A Multivalued Evolutionary Algorithm
نویسنده
چکیده
With this paper we present a Multivalued Evolutionary Algorithm (MEA) which is inspired by fuzzy set theory. The genetic representation and encoding is done in such a way that no inferences can be drawn from phenotype to genotype. This representation innuences the used genetic operators. The basic operators of the algorithm will be explained and comparisons for global optimization problems with recently published results will be presented.
منابع مشابه
A New Iterative Algorithm for Multivalued Nonexpansive Mappping and Equlibruim Problems with Applications
In this paper, we introduce two iterative schemes by a modified Krasnoselskii-Mann algorithm for finding a common element of the set of solutions of equilibrium problems and the set of fixed points of multivalued nonexpansive mappings in Hilbert space. We prove that the sequence generated by the proposed method converges strongly to a common element of the set of solutions of equilibruim proble...
متن کاملMultivalued Evolutionary Algorithms
One feature of evolving populations is that genetic operators act on the genotypic level while selection acts on the phenotypic level. We call the transformation between genes and phenes a developmental process because of its dynamics. Generally, no inferences can be made from phenes to genes, i.e. the mapping from genes to phenes is not an isomorphic one as it is assumed in Genetic Algorithms ...
متن کاملModal Mutations in Evolutionary Algorithms
| With this paper Modal Mutation Schemes for Evolutionary Algorithms as a generalization of the Breeder Genetic Algorithm mutation scheme are introduced and analyzed for multimodal continuous parameter optimization problems. A new scaling rule for multiple mutations is formalized and compared with a new step-size scaling for Evolution Strategies. A performance comparison of the Multivalued Evol...
متن کاملComposition of resolvents and quasi-nonexpansive multivalued mappings in Hadamared spaces
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. In this paper we propose an iterative algorithm for finding the common element of the minimizers of a finite family of convex functions a...
متن کاملA level set based Eulerian method for paraxial multivalued traveltimes
We apply the level-set methodology to compute multivalued solutions of the paraxial eikonal equation in both isotropic and anisotropic metrics. This paraxial equation is obtained from 2D stationary eikonal equations by using one of the spatial directions as the artificial evolution direction. The advection velocity field used to move level sets is obtained by the method of characteristics; ther...
متن کامل